Sound Global Caching for Abstract Modal Tableaux
نویسندگان
چکیده
We give the first formal formalisation of global caching for abstract modal tableaux. Our global caching method is sound and applicable to different tableau calculi of (EXPTime-complete) modal or description logics to produce optimal (EXPTime) decision procedures.
منابع مشابه
ExpTime Tableaux with Global Caching for Graded Propositional Dynamic Logic
We present the first direct tableau decision procedure for graded PDL, which uses global caching and has ExpTime (optimal) complexity when numbers are encoded in unary. It shows how to combine integer linear feasibility checking with checking fulfillment of existential star modalities for tableaux with global caching.
متن کاملAnalytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs
We present a sound and complete tableau calculus for a class BReg of extended regular grammar logics which contains useful epistemic logics for reasoning about agent beliefs. Our calculus is cut-free and has the analytic superformula property so it gives a decision procedure. Applying sound global caching to the calculus, we obtain the first optimal (EXPTime) tableau decision procedure for BReg...
متن کاملGlobal Caching for the Alternation-free μ-Calculus
We present a sound, complete, and optimal single-pass tableau algorithm for the alternation-free μ-calculus. The algorithm supports global caching with intermediate propagation and runs in time 2O(n). In game-theoretic terms, our algorithm integrates the steps for constructing and solving the Büchi game arising from the input tableau into a single procedure; this is done onthe-fly, i.e. may ter...
متن کاملExpTime Tableaux with Global Caching for Hybrid PDL
We present the first direct tableau decision procedure with the ExpTime complexity for HPDL (Hybrid Propositional Dynamic Logic). It checks whether a given ABox (a finite set of assertions) in HPDL is satisfiable. Technically, it combines global caching with checking fulfillment of eventualities and dealing with nominals. Our procedure contains enough details for direct implementation and has b...
متن کاملEXPTIME Tableaux for ALC Using Sound Global Caching
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w.r.t. a TBox in the basic description logic ALC. Our algorithm is based on a simple traditional tableau calculus which builds an and-or graph where no two nodes of the graph contain the same formula set. When a duplicate...
متن کامل